翻訳と辞書 |
Skew partition : ウィキペディア英語版 | Skew partition
In graph theory, a skew partition of a graph is a partition of its vertices into two subsets, such that the induced subgraph formed by one of the two subsets is disconnected and the induced subgraph formed by the other subset is the complement of a disconnected graph. Skew partitions play an important role in the theory of perfect graphs. ==Definition== A skew partition of a graph is a partition of its vertices into two subsets and for which the induced subgraph is disconnected and the induced subgraph is the complement of a disconnected graph (co-disconnected). Equivalently, a skew partition of a graph may be described by a partition of the vertices of into four subsets , , , and , such that there are no edges from to and such that all possible edges from to exist; for such a partition, the induced subgraphs and are disconnected and co-disconnected respectively, so we may take and .
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Skew partition」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|